Ration-space Obstacles Using the Fast Fourier Transform

Computation of Configuration-Space Obstacles Using the Fast Fourier Transform

Computation of Configuration-Space Obstacles Using the Fast Fourier Tkansform

Thh paper presents a new method for computing the configuration-space map of obstacles that is used in motion-planning algorithms. The method derives from the observation that, when the robot is a rigid object that can only translate, the configuration space is a convolution of the workspace and the robot. This convolution is computed with the use of the Fast Fourier Transform (FFT) algorithm. ...

Computation of Robot Configuration and Workspaces via the Fourier Transform on the Discrete-Motion Group

We apply the Fourier transform on the discrete-motion group to the problem of computing the configuration-space obstacles of mobile robots which move among static obstacles, the problem of finding the workspace density of binary manipulators with many actuators, and the problem of determining workspace boundaries of manipulators with continuous-motion actuators. We develop and implement Fourier...

Pathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)

This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds.     The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...

Equivalence of K-functionals and modulus of smoothness for fourier transform

In Hilbert space L2(Rn), we prove the equivalence between the mod-ulus of smoothness and the K-functionals constructed by the Sobolev space cor-responding to the Fourier transform. For this purpose, Using a spherical meanoperator.